Efficient and robust policy routing using multiple hierarchical addresses

Loop - Free Internet Routing Using Hierarchical Routing

We present a new hierarchical routing algorithm that combines the loop-free path-nding algorithm (LPA) with the area-based hierarchical routing scheme rst proposed by McQuillan for distance-vector algorithms. The new algorithm, which we call the Hierarchical Information Path-based Routing (HIPR) algorithm , accommodates an arbitrary number of aggrega-tion levels and can be viewed as a distribut...

Efficient Policy-Based Routing In The Internet

Hierarchical Routing Using Link Vectors

An area-based link-vector algorithm (ALVA) is introduced for the distributed maintenance of routing information in very large internetworks. According to ALVA, destinations in an internetwork are aggregated in areas in multiple levels of hierarchy. Routers maintain a database that contains a subset of the topology at each level of the hierarchy. This subset corresponds to those links used in pr...

Hierarchical policy delegation in multiple-authority ABE

We present HM-ABE, a hierarchical multi-authority attributebased encryption scheme with policy delegation, that generalizes current work significantly. Current methods require encryptors to build ciphertext access policies themselves, using attributes published by authority domains. This causes problems, both since authorities may not publish sensitive attributes, and since users may not unders...

Efficient Robust Policy Optimization (Long Version)

The goal of this paper is to provide efficient algorithms to calculate first and second order gradients of the cost of a control law with respect to its parameters, to speed up policy optimization. The approach achieves robustness by simultaneously designing one control law for multiple models with potentially different model structures, which represent model uncertainty and unmodeled dynamics....